41 research outputs found
Strong Hanani-Tutte on the Projective Plane
If a graph can be drawn in the projective plane so that every two non-adjacent edges cross an even number of times, then the graph can be embedded in the projective plane
Strong Hanani-Tutte for the Torus
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus
Dominating Sets in Plane Triangulations
In 1996, Matheson and Tarjan conjectured that any n-vertex triangulation with
n sufficiently large has a dominating set of size at most n/4. We prove this
for graphs of maximum degree 6.Comment: 14 pages, 6 figures; Revised lemmas 6-8, clarified arguments and
fixed typos, result unchange
Flexible list colorings: Maximizing the number of requests satisfied
Flexible list coloring was introduced by Dvo\v{r}\'{a}k, Norin, and Postle in
2019. Suppose , is a graph, is a list
assignment for , and is a function with non-empty domain such that for each ( is called a request of
). The triple is -satisfiable if there exists a proper
-coloring of such that for at least
vertices in . We say is -flexible if is
-satisfiable whenever is a -assignment for and is a
request of . It was shown by Dvo\v{r}\'{a}k et al. that if is prime,
is a -degenerate graph, and is a request for with domain of size
, then is -satisfiable whenever is a -assignment. In
this paper, we extend this result to all for bipartite -degenerate
graphs.
The literature on flexible list coloring tends to focus on showing that for a
fixed graph and there exists an such that
is -flexible, but it is natural to try to find the largest
possible for which is -flexible. In this vein, we
improve a result of Dvo\v{r}\'{a}k et al., by showing -degenerate graphs are
-flexible. In pursuit of the largest for which a
graph is -flexible, we observe that a graph is not -flexible for any if and only if , where
is the Hall ratio of , and we initiate the study of the list
flexibility number of a graph , which is the smallest such that is
-flexible. We study relationships and connections between the
list flexibility number, list chromatic number, list packing number, and
degeneracy of a graph.Comment: 19 page
Statistical models for cores decomposition of an undirected random graph
The -core decomposition is a widely studied summary statistic that
describes a graph's global connectivity structure. In this paper, we move
beyond using -core decomposition as a tool to summarize a graph and propose
using -core decomposition as a tool to model random graphs. We propose using
the shell distribution vector, a way of summarizing the decomposition, as a
sufficient statistic for a family of exponential random graph models. We study
the properties and behavior of the model family, implement a Markov chain Monte
Carlo algorithm for simulating graphs from the model, implement a direct
sampler from the set of graphs with a given shell distribution, and explore the
sampling distributions of some of the commonly used complementary statistics as
good candidates for heuristic model fitting. These algorithms provide first
fundamental steps necessary for solving the following problems: parameter
estimation in this ERGM, extending the model to its Bayesian relative, and
developing a rigorous methodology for testing goodness of fit of the model and
model selection. The methods are applied to a synthetic network as well as the
well-known Sampson monks dataset.Comment: Subsection 3.1 is new: `Sample space restriction and degeneracy of
real-world networks'. Several clarifying comments have been added. Discussion
now mentions 2 additional specific open problems. Bibliography updated. 25
pages (including appendix), ~10 figure
Removing Even Crossings
An edge in a drawing of a graph is called if it intersects every other edge of the graph an even number of times. Pach and Tóth proved that a graph can always be redrawn such that its even edges are not involved in any intersections. We give a new, and significantly simpler, proof of a slightly stronger statement. We show two applications of this strengthened result: an easy proof of a theorem of Hanani and Tutte (not using Kuratowski's theorem), and the result that the odd crossing number of a graph equals the crossing number of the graph for values of at most . We begin with a disarmingly simple proof of a weak (but standard) version of the theorem by Hanani and Tutte